Corona: A Stabilizing Deterministic Message-Passing Skip List
نویسندگان
چکیده
We present Corona, a deterministic self-stabilizing algorithm for skip list construction in structured overlay networks. Corona operates in the low-atomicity message-passing asynchronous system model. Corona requires constant process memory space for its operation and, therefore, scales well. We prove the general necessary conditions limiting the initial states from which a self-stabilizing structured overlay network in message-passing system can be constructed. The conditions require that initial state information has to form a weakly connected graph and it should only contain identifiers that are present in the system. We formally describe Corona and rigorously prove that it stabilizes from an arbitrary initial state subject to the necessary conditions. We extend Corona to construct a skip graph.
منابع مشابه
Tiara: A Self-stabilizing Deterministic Skip List
We present Tiara — a self-stabilizing peer-to-peer network maintenance algorithm. Tiara is truly deterministic which allows it to achieve exact performance bounds. Tiara allows logarithmic searches and updates and it stabilizes in linear time. It is based on sparse 0-1 skip list. We rigorously prove the algorithm correct in the shared register model. We then describe its refinement to the messa...
متن کاملTiara: A self-stabilizing deterministic skip list and skip graph
We present Tiara — a self-stabilizing peer-to-peer network maintenance algorithm. Tiara is truly deterministic which allows it to achieve exact performance bounds. Tiara allows logarithmic searches and topology updates. It is based on a novel sparse 0-1 skip list. We then describe its extension to a ringed structure and to a skip-graph.
متن کاملA Service-oriented Scalable Dictionary in MPI
In this paper we present a distributed, in-memory, message passing implementation of a dynamic ordered dictionary structure. The structure is based on a distributed fine-grain implementation of a skip list that can scale across a cluster of multicore machines. We present a service-oriented approach to the design of distributed data structures in MPI where the skip list elements are active proce...
متن کاملSelf-stabilizing K-out-of-L exclusion on tree network
In this paper, we address the problem of k-out-of-l exclusion, a generalization of the mutual exclusion problem, in which there are l units of a shared resource, and any process can request up to k units (1 ≤ k ≤ l). We propose the first deterministic self-stabilizing distributed k-out-of-l exclusion protocol in message-passing systems for asynchronous oriented tree networks which assumes bound...
متن کاملSelf-Stabilizing k-out-of-! Exclusion on Tree Networks
In this paper, we address the problem of k-out-of-! exclusion, a generalization of the mutual exclusion problem, in which there are ! units of a shared resource, and any process can request up to k units (1 ≤ k ≤ !). We propose the first deterministic self-stabilizing distributed k-out-of-! exclusion protocol in message-passing systems for asynchronous oriented tree networks which assumes bound...
متن کامل